The search functionality is under construction.

Author Search Result

[Author] Toru SATO(33hit)

21-33hit(33hit)

  • Orbit Determination of Meteors Using the MU Radar

    Toru SATO  Takuji NAKAMURA  Koji NISHIMURA  

     
    PAPER

      Vol:
    E83-B No:9
      Page(s):
    1990-1995

    Meteor storms and showers are now considered as potential hazard in the space environment. Radar observations of meteors has an advantage of a much higher sensitivity over optical observations. The MU radar of Kyoto University, Japan has a unique capability of very fast beam steerability as well as a high sensitivity to the echoes from ionization around the meteors. We developed a special observation scheme which enables us to determine the orbit of individual meteors. The direction of the target is determined by comparing the echo intensity at three adjacent beams. The Doppler pulse compression technique is applied to improve the signal-to-noise ratio of the echoes from the very fast target, and also to determine the range accurately. The developed scheme was applied to the observation made during the Leonid meteor storm on November 18, 1998 (JST). Estimated orbital distribution seems to suggest that the very weak meteors detected by the MU radar are dominated by sporadic meteors rather than the stream meteors associated with the Leonids storm.

  • Parallel Viterbi Decoding Implementation by Multi-Microprocessors

    Hui ZHAO  Xiaokang YUAN  Toru SATO  Iwane KIMURA  

     
    PAPER-Communication Theory

      Vol:
    E76-B No:6
      Page(s):
    658-666

    The Viterbi algorithm is a well-established technique for channel and source decoding in high performance digital communication systems. However, excessive time consumption makes it difficult to design an efficient high-speed decoder for practical application. This paper describes the implementation of parallel Viterbi algorithm by multi-microprocessors. Internal computations are performed in a parallel fashion. The use of microprocessors allows low-cost implementation with moderate complexity. The software and hardware implementations of the Viterbi algorithm on parallel multi-microprocessors for real-time decoding are presented. The implemented method is based on a combination of forming a set of tables and calculations. For efficient operation under fully parallel Viterbi decoding by microprocessors, we considered: (1) branch metrics processing, path metrics updating, path memory updating and decoding output for microprocessor, (2) efficient decomposition of the sequential Viterbi algorithm into parallel algorithms, (3) minimization of the communication among the microprocessors. The practical solutions for the problems of synchronization among the miroprocessors, interconnection network for communication among the microprocessors and memory management are discussed. Furthermore the performance and the speed of the parallel Viterbi decoding are given. For a fixed processing speed of given hardwares, parallel Viterbi decoding allows a linear speed up in the throughput rate with a linear increase in hardware complexity.

  • 2-Dimensional Accurate Imaging with UWB Radar Using Indoor Multipath Echoes for a Target in Shadow Regions

    Shuhei FUJITA  Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Sensing

      Vol:
    E94-B No:8
      Page(s):
    2366-2374

    UWB (Ultra Wide-Band) pulse radar is promising for surveillance systems because it has an outstanding high range-resolution. To realize an accurate UWB radar imaging system, we propose a new approach that employs multipath echoes from a target in an indoor environment. Using multipath echoes, the proposed system can accurately estimate images, even for targets in a shadow region where the targets are out of sight of the antenna. We apply a simple interferometry technique using the multiple mirror image antennas generated by multipath propagation. We find that this simple method also produces many undesired false image points. To tackle this issue, we also propose an effective false image reduction algorithm to obtain a clear image. Numerical simulations verify that most of the false image points are removed and the target shape is accurately estimated.

  • Fast and Accurate 3-D Imaging Algorithm with Linear Array Antennas for UWB Pulse Radars

    Shouhei KIDERA  Yusuke KANI  Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Sensing

      Vol:
    E91-B No:8
      Page(s):
    2683-2691

    Pulse radars with UWB signals are promising as a high-resolution imaging technique that can be used for the non-destructive measurement of surface details in industrial products such as antennas and aircraft. We have already proposed a fast 3-D imaging algorithm, SEABED, that utilizes a reversible transform between the time delay and the target boundary. However, data acquisition is time-consuming when obtaining an accurate image because it assumes a mono-static radar with 2-D scanning of an antenna. In this paper, we utilize linear array antennas and propose a fast and accurate imaging algorithm. We extend the reversible transform for mono-static radars to apply to bi-static radars to reduce the data acquisition time. The effectiveness of the proposed method is verified with numerical simulations and experiments.

  • A Faster Algorithm of Minimizing AND-EXOR Expressions

    Takashi HIRAYAMA  Yasuaki NISHITANI  Toru SATO  

     
    PAPER-Logic Synthesis

      Vol:
    E85-A No:12
      Page(s):
    2708-2714

    It has been considered difficult to obtain the minimum AND-EXOR expression of a given function with six variables in a practical computing time. In this paper, a faster algorithm of minimizing AND-EXOR expressions is proposed. We believe that our algorithm can compute the minimum AND-EXOR expressions of any six-variable and some seven-variable functions practically. In this paper, we first present a naive algorithm that searches the space of expansions of a given n-variable function f for a minimum expression of f. The space of expansions are generated by using all combinations of (n-1)-variable product terms. Then, how to prune the branches in the search process and how to restrict the search space to obtain the minimum solutions are discussed as the key point of reduction of the computing time. Finally a faster algorithm is constructed by using the methods discussed. Experimental results to demonstrate the effectiveness of these methods are also presented.

  • A Target Shape Estimation Algorithm for Pulse Radar Systems Based on Boundary Scattering Transform

    Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Sensing

      Vol:
    E87-B No:5
      Page(s):
    1357-1365

    Environment measurement is an important issue for various applications including household robots. Pulse radars are promising candidates in a near future. Estimating target shapes using waveform data, which we obtain by scanning an omni-directional antenna, is known as one of ill-posed inverse problems. Parametric methods such as Model-fitting method have problems concerning calculation time and stability. We propose a non-parametric algorithm for high-resolution estimation of target shapes in order to solve the problems of parametric algorithms.

  • Adaptive Sidelobe Cancellation Technique for Atmospheric Radars Containing Arrays with Nonuniform Gain

    Taishi HASHIMOTO  Koji NISHIMURA  Toru SATO  

     
    PAPER-Antennas and Propagation

      Pubricized:
    2016/06/21
      Vol:
    E99-B No:12
      Page(s):
    2583-2591

    The design and performance evaluation is presented of a partially adaptive array that suppresses clutter from low elevation angles in atmospheric radar observations. The norm-constrained and directionally constrained minimization of power (NC-DCMP) algorithm has been widely used to suppress clutter in atmospheric radars, because it can limit the signal-to-noise ratio (SNR) loss to a designated amount, which is the most important design factor for atmospheric radars. To suppress clutter from low elevation angles, adding supplemental antennas that have high response to the incoming directions of clutter has been considered to be more efficient than to divide uniformly the high-gain main array. However, the proper handling of the gain differences of main and sub-arrays has not been well studied. We performed numerical simulations to show that using the proper gain weighting, the sub-array configuration has better clutter suppression capability per unit SNR loss than the uniformly divided arrays of the same size. The method developed is also applied to an actual observation dataset from the MU radar at Shigaraki, Japan. The properly gain-weighted NC-DCMP algorithm suppresses the ground clutter sufficiently with an average SNR loss of about 1 dB less than that of the uniform-gain configuration.

  • Two-Dimensional Imaging of a Pedestrian Using Multiple Wideband Doppler Interferometers with Clustering-Based Echo Association

    Takuya SAKAMOTO  Hiroki YAMAZAKI  Toru SATO  

     
    PAPER

      Vol:
    E98-B No:9
      Page(s):
    1795-1803

    This paper presents a method of imaging a two-dimensional section of a walking person using multiple Doppler radar systems. Although each simple radar system consists of only two receivers, different radial speeds allow target positions to be separated and located. The signal received using each antenna is processed employing time-frequency analysis, which separates targets in the time-range-velocity space. This process is followed by a direction-of-arrival estimation employing interferometry. The data obtained using the multiple radar systems are integrated using a clustering algorithm and a target-tracking algorithm. Through realistic simulations, we demonstrate the remarkable performance of the proposed imaging method in generating a clear outline image of a human target in unknown motion.

  • High-Resolution Radar Image Reconstruction Using an Arbitrary Array

    Toshio WAKAYAMA  Toru SATO  Iwane KIMURA  

     
    PAPER-Subsurface Radar

      Vol:
    E76-B No:10
      Page(s):
    1305-1312

    Radar imaging technique is one of the most powerful tool for underground detection. However, performance of conventional methods is not sufficiently high when the observational direction or the aperture size is restricted. In the present paper, an image reconstruction method based on a model fitting with nonlinear least-squares has been developed, which is applicable to arbitrarily arranged arrays. Reconstruction is executed on the assumption that targets consist of discrete point scatterers embedded in a homogeneous medium. Model fitting is iterated as the number of point target in the assumed model is increased, until the residual in fitting becomes unchanged or small enough. A penalty function is used in nonlinear least-squares to make the algorithm stable. Fundamental characteristics of the method revealed with computer simulation are described. This method focuses a much sharper image than that obtained by the conventional aperture synthesis technique.

  • A Hybrid-ARQ Protocol with Adaptive Rate Error Control

    Hui ZHAO  Toru SATO  Iwane KIMURA  

     
    PAPER-Information Theory and Coding Theory

      Vol:
    E76-A No:12
      Page(s):
    2095-2101

    This paper presents an adaptive rate error control scheme for digital communication over time-varying channels. The cyclic code with majority-logic decoding is used in a cascaded way as an inner code to create a simple and powerful hybrid-ARQ error control scheme. Inner code is used only for error correction and the outer code is used for both error correction and error detection. When an error is detected, retransmission is required. The unsuccessful packets are not discarded as with conventional schemes, but are combined with their retransmitted copies. Approximations for the throughput efficiency and the undetectable error probability are given. A high reliability coupled with a simple high-speed implementation makes it suitable for high data rate error control over both stationary and nonstationary channels. Adaptive error control scheme becomes the best solution for time-varying channels when the optimum code is selected according to the actual channel conditions to enhance the system performance. The main feature of this system is that the basic structure of the encoder and decoder need not be modified while the error-correction capability of the code increases. Results of a comparative analysis show that the proposed scheme outperforms other similar ARQ protocols.

  • Transfer Information Enhancement with a 2-D Tactile Stimulator Array for an Acoustic Vision Substitute System

    Hirofumi TAKI  Toru SATO  

     
    PAPER-Rehabilitation Engineering and Assistive Technology

      Vol:
    E90-D No:5
      Page(s):
    808-815

    Existing vision substitute systems have insufficient spatial resolution to provide environmental information. To present detailed spatial information, we propose two stimulation methods to enhance transfer information using a 2-D tactile stimulator array. First, stimulators are divided into several groups. Since each stimulator group is activated alternately, the interval of stimulations can be shortened to less than the two-point discrimination threshold. In the case that stimulators are divided into two and four groups, the number of stimulators increases to twice and four times, respectively, that in the case of the two-point discrimination threshold. Further, a user selects the measurement range and the system presents targets within the range. The user acquires spatial information of the entire measurement area by changing the measurement range. This method can accurately present a range of targets. We examine and confirm these methods experimentally.

  • An Imaging Algorithm of a Target with Arbitrary Motion for Ultra Wide-Band Radar with a Small Number of Antennas

    Yuji MATSUKI  Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Antennas and Propagation

      Vol:
    E94-B No:3
      Page(s):
    742-749

    UWB (ultra wide-band) pulse radar is a promising candidate for surveillance systems. The fast SEABED (Shape Estimation Algorithm based on BST and Extraction of Directly scattered waves) imaging algorithm is deployed in the application of UWB pulse radar in fields that require real-time operations. However, since the SEABED algorithm uses signals received at multiple locations, this method either needs to scan antennas or to install many antennas. Such systems are inevitably costly and unrealistic for applications such as surveillance. To overcome this problem, a revised SEABED algorithm that estimates unknown target shape based on target motion using only a pair of fixed antennas was developed. However, the method cannot be used when the target moves arbitrarily because it assumes the target motion is parallel to the baseline of the pair of antennas. In this paper, we propose a new UWB radar imaging algorithm that is applicable even for targets with arbitrary motion. The proposed method introduces another antenna which is added to the pair of antennas used in the revised SEABED, and estimates unknown target motion based on the target surface using the three antennas. Next, the proposed method applies the SEABED imaging algorithm to the estimated motion and obtains the target image. Some numerical simulations establishes that the proposed method can accurately estimate the target shape even under severe conditions.

  • A Robust and Fast Imaging Algorithm with an Envelope of Circles for UWB Pulse Radars

    Shouhei KIDERA  Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Sensing

      Vol:
    E90-B No:7
      Page(s):
    1801-1809

    Target shape estimation with UWB pulse radars is a promising imaging technique for household robots. We have already proposed a fast imaging algorithm, SEABED, that is based on a reversible transform BST (Boundary Scattering Transform) between the received signals and the target shape. However, the target image obtained by SEABED deteriorates in a noisy environment because it utilizes a derivative of received data. In this paper, we propose a robust imaging method with an envelope of circles. We clarify by numerical simulation that the proposed method can realize a level of robust and fast imaging that cannot be achieved by the original SEABED.

21-33hit(33hit)